Clifford Boundary Conditions: A Simple Direct-Sum Evaluation of Madelung Constants
نویسندگان
چکیده
منابع مشابه
Elementary function expansions for Madelung constants
The Madelung constant-essentially the Coulomb energy density of a crystal-is usually calculated via Ewald error function expansions or, for the simpler cubic structures, by the 'cosech' series of modern vintage. By considering generalised functional equations for multidimensional zeta functions, we provide explicit expansions for the spatial potential and energy density of three-dimensional per...
متن کاملA Simple Method for Computing Minkowski Sum Boundary in 3D
Computing the Minkowski sum of two polyhedra exactly has been shown difficult. Despite its fundamental role in many geometric problems in robotics, to the best of our knowledge, no 3-d Minkowski sum software for general polyhedra is available to the public. One of the main reasons is the difficulty of implementing the existing methods. There are two main approaches for computing Minkowski sums:...
متن کاملA GPU-accelerated Direct-sum Boundary Integral Poisson-Boltzmann Solver
In this paper, we present a GPU-accelerated direct-sum boundary integral method to solve the linear Poisson-Boltzmann (PB) equation. In our method, a well-posed boundary integral formulation is used to ensure the fast convergence of Krylov subspace based linear algebraic solver such as the GMRES. The molecular surfaces are discretized with flat triangles and centroid collocation. To speed up ou...
متن کاملOptimal Sobolev and Hardy-Rellich constants under Navier boundary conditions
We prove that the best constant for the critical embedding of higher order Sobolev spaces does not depend on all the traces. The proof uses a comparison principle due to Talenti [19] and an extension argument which enables us to extend radial functions from the ball to the whole space with no increase of the Dirichlet norm. Similar arguments may also be used to prove the very same result for Ha...
متن کاملOn the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs
For a coloring $c$ of a graph $G$, the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively $sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$, where the summations are taken over all edges $abin E(G)$. The edge-difference chromatic sum, denoted by $sum D(G)$, and the edge-sum chromatic sum, denoted by $sum S(G)$, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Physical Chemistry Letters
سال: 2020
ISSN: 1948-7185,1948-7185
DOI: 10.1021/acs.jpclett.0c01684